Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
x + (y + z) |
→ (x + y) + z |
| 2: |
|
x * (y + z) |
→ (x * y) + (x * z) |
| 3: |
|
(x + (y * z)) + (y * u) |
→ x + (y * (z + u)) |
|
There are 8 dependency pairs:
|
| 4: |
|
x +# (y + z) |
→ (x + y) +# z |
| 5: |
|
x +# (y + z) |
→ x +# y |
| 6: |
|
x *# (y + z) |
→ (x * y) +# (x * z) |
| 7: |
|
x *# (y + z) |
→ x *# y |
| 8: |
|
x *# (y + z) |
→ x *# z |
| 9: |
|
(x + (y * z)) +# (y * u) |
→ x +# (y * (z + u)) |
| 10: |
|
(x + (y * z)) +# (y * u) |
→ y *# (z + u) |
| 11: |
|
(x + (y * z)) +# (y * u) |
→ z +# u |
|
Consider the SCC {4-11}.
The constraints could not be solved.
Tyrolean Termination Tool (0.07 seconds)
--- May 3, 2006